A Dynamic Replica Placement Algorithm to Enhance Multiple Failures Capability in Distributed System
نویسندگان
چکیده
منابع مشابه
Dynamic Replica Placement in Content Delivery Network
The Content Delivery Networks (CDN) paradigm is based on the idea to move third-party content closer to the users transparently. More specifically, content is replicated on servers closer to the users, and users requests are redirected to the best replica in a transparent way, so that the user perceives better content access service. In this paper we address the problem of dynamic replica place...
متن کاملDynamic Replica Placement for Scalable Content Delivery
In this paper, we propose the dissemination tree, a dynamic content distribution system built on top of a peer-to-peer location service. We present a replica placement protocol that builds the tree while meeting QoS and server capacity constraints. The number of replicas as well as the delay and bandwidth consumption for update propagation are significantly reduced. Simulation results show that...
متن کاملA new Replica Placement Algorithm in Data Grid
Replica placement is one of the important factors to improve performance in data grid systems. A good replica placement algorithm can result in good performance gains. It should be mentioned that, these algorithms or strategies are dependent on architecture of the data grid. By considering different kinds of architecture in data grid systems, a true representation of a grid is a general graph. ...
متن کاملAdaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments
Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...
متن کاملModeling Replica Placement in a Distributed File System: Narrowing the Gap between Analysis and Simulation
We examine the replica placement aspect of a distributed peer-to-peer le system that replicates and stores les on ordinary desktop computers. It has been shown that some desktop machines are available for a greater fraction of time than others, and it is crucial not to place all replicas of any le on machines with low availability. In this paper we study the eÆcacy of three hill-climbing algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed and Parallel systems
سال: 2011
ISSN: 2229-3957
DOI: 10.5121/ijdps.2011.2607